Browsing by Subject "Polynomial approximation"

Now showing items 1-10 of 10

    • Article  

      Bounds on the number of markings consistent with label observations in petri nets 

      Ru, Y.; Hadjicostis, Christoforos N. (2009)
      In this paper, we consider state estimation in discrete-event systems (DESs) modeled by labeled Petri nets and present upper bounds on the number of system states (or markings) that are consistent with an observed sequence ...
    • Article  

      Computing Nash equilibria for scheduling on restricted parallel links 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2010)
      We consider the problem of routing nusers on m parallel links under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. So, this problem is equivalent to the ...
    • Article  

      Direct routing: Algorithms and complexity 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios; Spirakis, Paul G. (2004)
      Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...
    • Article  

      Minimum initial marking estimation in labeled petri nets 

      Li, L.; Hadjicostis, Christoforos N. (2013)
      This technical note develops algorithms for estimating the minimum initial marking(s) following the observation of a sequence of labels produced by underlying transition activity in a known labeled Petri net (PN). Since ...
    • Article  

      A new model for selfish routing 

      Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2008)
      In this work, we introduce and study a new, potentially rich model for selfish routing over non-cooperative networks, as an interesting hybridization of the two prevailing such models, namely the KPmodel [E. Koutsoupias, ...
    • Conference Object  

      The power of the defender 

      Gelastou, Marina; Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Philippou, Anna; Spirakis, Paul G. (2006)
      We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in the ...
    • Article  

      The price of defense and fractional matchings 

      Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Persiano, Giuseppe; Philippou, Anna; Spirakis, Paul G. (2006)
      Consider a network vulnerable to security attacks and equipped with defense mechanisms. How much is the loss in the provided security guarantees due to the selfish nature of attacks and defenses? The Price of Defense was ...
    • Article  

      The Singular Function Boundary Integral Method for singular Laplacian problems over circular sections 

      Christodoulou, Evgenia; Xenophontos, Christos A.; Georgiou, Georgios C. (2010)
      The Singular Function Boundary Integral Method (SFBIM) for solving two-dimensional elliptic problems with boundary singularities is revisited. In this method the solution is approximated by the leading terms of the asymptotic ...
    • Conference Object  

      Towards feasible implementations of low-latency multi-writer atomic registers 

      Georgiou, Chryssis; Nicolaou, Nicolas C.; Russell, A. C.; Shvartsman, A. A. (2011)
      This work explores implementations of multi-writer/multi-reader (MWMR) atomic registers in asynchronous, crash-prone, message-passing systems with the focus on low latency and computational feasibility. The efficiency of ...
    • Article  

      Weak bisimulation for probabilistic systems 

      Philippou, Anna; Lee, I.; Sokolsky, O. (2000)
      In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabilistic and nondeterministic behavior. By resolving the ...